Irreducible skew polynomials over domains

نویسندگان

چکیده

Abstract Let S be a domain and R = [ t ; σ, δ ] skew polynomial ring, where σ is an injective endomorphism of left -derivation. We give criteria for polynomials f ∈ degree less or equal to four irreducible. apply them low in quantized Weyl algebras the quantum planes. also consider ( ) m − .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...

متن کامل

Construction of Irreducible Polynomials over Finite Fields

In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...

متن کامل

Hamming Distance from Irreducible Polynomials Over

We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that the number of degree n polynomials of Hamming distance one from a randomly chosen set of b2n/nc o...

متن کامل

Constructing irreducible polynomials over finite fields

We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev’s density theorem.

متن کامل

Generators and irreducible polynomials over finite fields

Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analele Stiintifice Ale Universitatii Ovidius Constanta-seria Matematica

سال: 2021

ISSN: ['1224-1784', '1844-0835']

DOI: https://doi.org/10.2478/auom-2021-0035